Kernels in some orientations of comparability graphs
نویسندگان
چکیده
منابع مشابه
Online Coloring of Comparability Graphs: some results
We study online partitioning of posets from a graph theoretical point of view, which is coloring and cocoloring in comparability graphs. For the coloring problem, we analyse the First-Fit algorithm and show a ratio of O( √ n); furthermore, we devise an algorithm with a competitivity ratio of χ+1 2 . For the cocoloring problem, we point out a tight bound of n 4 + 1 2 and we give better bounds in...
متن کاملComparability graphs and intersection graphs
A function diagram (f-diagram) D consists of the family of curves {i, . . . , ii} obtained from n continuous functions fi : [O, 1] -B R (1 G i d n). We call the intersection graph of D a function graph (f-graph). It is shown that a graph G is an f-graph if and only if its complement 0 is a comparability graph. An f-diagram generalizes the notion cf a permutation diagram where the fi are linear ...
متن کاملideological and cultural orientations in translation of narrative text: the case of hajji baba of isfahan
در میان عواملی که ممکن است ذهن مترجم را هنگام ترجمه تحت تأثیر قرار دهند، می توان به مقوله انتقال ایدئولوژی از طریق متن یا گفتمان اشاره کرد. هدف از این تحقیق تجزیه و تحلیل جنبه های ایدئولوژیکی و فرهنگی متن مبدأ انگلیسی نوشته جیمز موریه تحت عنوان سرگذشت حاجی بابای اصفهانی ( 1823) و ترجمه فارسی میرزا حبیب اصفهانی(1880) بوده است.
Partitioned Probe Comparability Graphs
Given a class of graphs G, a graphG is a probe graph of G if its vertices can be partitioned into a set of probes and an independent set of nonprobes such that G can be embedded into a graph of G by adding edges between certain nonprobes. If the partition of the vertices is part of the input, we call G a partitioned probe graph of G. In this paper we show that there exists a polynomial-time alg...
متن کاملTreelike Comparability Graphs
A comparability graph is a simple graph which admits a transitive orientation on its edges. Each one of such orientations defines a poset on the vertex set, and also it is said that this graph is the comparability graph of the poset. A treelike poset is a poset whose covering graph is a tree. Comparability graphs of arborescence posets are known as trivially perfect graphs. These have been char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1989
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90070-1